A Class of Nonsymmetric Preconditioners for Saddle Point Problems Dedicated to Henk A. Van Der Vorst on Occasion of His 60th Birthday
نویسنده
چکیده
For the iterative solution of saddle point problems, a nonsymmetric preconditioner is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves solution of a Schur complement system, an inexact form of the preconditioner can be of interest. This results in an inner-outer iterative process. Numerical experiments with solution of linearized Navier-Stokes equations demonstrate the efficiency of the new preconditioner, especially when the left-upper block is far from symmetric.
منابع مشابه
CLASSICAL SEQUENTS AND COMPUTATION : AN OVERVIEW To Henk Barendregt, in honour of his 60th birthday
This paper presents a short overview of some of the results achieved for the calculus X , which is based on Gentzen’s LK. It presents the calculus, its suitability for encoding the λ-calculus and the λμ-calculus, as well as a type-preserving encoding of X into the π-calculus.
متن کاملSharing in the Weak Lambda-calculus Revisited
In a previous paper [2] which appeared in the volume celebrating Klop’s 60th anniversary, we presented a labeled lambda-calculus to characterize the dag implementation of the weak lambda-calculus as described in Wadsworth’s dissertation [11]. In this paper, we simplify this calculus and present a simpler proof of the sharing property which allows the dag implementation. In order to avoid duplic...
متن کاملIntersection and Reference Types Dedicated to Henk Barendregt on the Occasion of His 60th Birthday
Aim of this paper is to understand the interplay between intersection and reference types. Putting together the standard typing rules for intersection types and reference types leads to loss of subject reduction. The problem comes from the invariance of the reference type constructor and the rule of intersection elimination, which is essentially a subsumption rule. We propose a solution which o...
متن کاملSubtyping À La Church
Type theories with higher-order subtyping or singleton types are examples of systems where the computational behavior of variables is determined by type information in the context. A complication for these systems is that bounds declared in the context do not interact well with the logical relation proof of completeness or termination. This paper proposes a simple modification to the type synta...
متن کاملComputation, Cooperation, and Life - Essays Dedicated to Gheorghe Paun on the Occasion of His 60th Birthday
It's coming again, the new collection that this site has. To complete your curiosity, we offer the favorite computation cooperation and life essays dedicated to gheorghe paun on the occasion of his 60th birthday lecture notes in computer science book as the choice today. This is a book that will show you even new to old thing. Forget it; it will be right for you. Well, when you are really dying...
متن کامل